
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1734. -- [Usaco2005 feb]Aggressive cows -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1734: [Usaco2005 feb]Aggressive cows</h2><span class=green>Time Limit: </span>5 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>80&nbsp;&nbsp;<span class=green>Solved: </span>64<br>[<a href='submitpage.php?id=1734'>Submit</a>][<a href='problemstatus.php?id=1734'>Status</a>][<a href='bbs.php?id=1734'>Discuss</a>]</center><h2>Description</h2><div class=content>Farmer John has built a new long barn, with N (2 <= N <= 100,000) stalls. 
The stalls are located along a straight line at positions x1,...,xN (0 <= xi <= 1,000,000,000). 
His C (2 <= C <= N) cows don't like this barn layout and become aggressive 
towards each other once put into a stall. To prevent the cows from hurting 
each other, FJ want to assign the cows to the stalls, such that the minimum 
distance between any two of them is as large as possible. What is the largest 
minimum distance?

农夫 John 建造了一座很长的畜栏，它包括NN (2 <= N <= 100,000)个隔间，这些小隔间依次编号为x1,...,xN (0 <= xi <= 1,000,000,000).
但是，John的C (2 <= C <= N)头牛们并不喜欢这种布局，而且几头牛放在一个隔间里，他们就要发生争斗。为了不让牛互相伤害。John决定自己给牛分配隔间，使任意两头牛之间的最小距离尽可能的大，那么，这个最大的最小距离是什么呢

输入规定：
第一行：空格分隔的两个整数N和C
第二行---第N+1行：i+1行指出了xi的位置

输出规定：
第一行：一个整数，最大的最小值
样例输入
5 3
1
2
8
4
9
样例输出
3

提示
把牛放在1，4，8这样最小距离是3

</div><h2>Input</h2><div class=content>* Line 1: Two space-separated integers: N and C 

* Lines 2..N+1: Line i+1 contains an integer stall location, xi

</div><h2>Output</h2><div class=content>* Line 1: One integer: the largest minimum distance

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 3<br />
1<br />
2<br />
8<br />
4<br />
9<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>3<br />
<br />
OUTPUT DETAILS: <br />
<br />
FJ can put his 3 cows in the stalls at positions 1, 4 and 8, resulting in a minimum distance of 3. <br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Gold'>Gold</a></p></div><center>[<a href='submitpage.php?id=1734'>Submit</a>][<a href='problemstatus.php?id=1734'>Status</a>][<a href='bbs.php?id=1734'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
